Discrepancy and large dense monochromatic subsets
نویسندگان
چکیده
منابع مشابه
Large almost monochromatic subsets in hypergraphs
We show that for all l and ǫ > 0 there is a constant c = c(l, ǫ) > 0 such that every l-coloring of the triples of an N -element set contains a subset S of size c √ logN such that at least 1 − ǫ fraction of the triples of S have the same color. This result is tight up to the constant c and answers an open question of Erdős and Hajnal from 1989 on discrepancy in hypergraphs. For l ≥ 4 colors, it ...
متن کاملMonochromatic Forests of Finite Subsets of N
It is known that if N is finitely colored, then some color class is piecewise syndetic. (See Definition 1.1 below for a definition of piecewise syndetic.) We generalize this result by considering finite colorings of the set of all finite subsets of N . The monochromatic objects obtained are “d-copies” of arbitrary finite forests and arbitrary infinite forests of finite height. Van der Waerden’s...
متن کاملOn Monochromatic Subsets of a Rectangular Grid
For n ∈ N, let [n] denote the integer set {0, 1, . . . , n − 1}. For any subset V ⊂ Z, let Hom(V ) = {cV + b : c ∈ N, b ∈ Z}. For k ∈ N, let Rk(V ) denote the least integer N0 such that for any N ≥ N0 and for any k-coloring of [N ] , there is a monochromatic subset U ∈ Hom(V ). The argument of Gallai ensures that Rk(V ) is finite. We investigate bounds on Rk(V ) when V is a three or four-point ...
متن کاملDense Subsets in Semigroups
This article covers a theory of dense subsets in general semigroups, including basic algebraic properties of dense and disjunctive subsets, characterizations of dense subset preserving homomorphisms and some remarkable properties of dense elements.
متن کاملDense Subsets of Ordered Sets
Some modifications of the definition of density of subsets in ordered (= partially ordered) sets are given and the corresponding concepts are compared.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2019
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2019.v10.n1.a4